An Optimal Algorithm for Reducing Edge-Solvable Mutual Exclusion Graphs
نویسندگان
چکیده
منابع مشابه
When does a correct mutual exclusion algorithm guarantee mutual exclusion?
Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملAn Eecient Token-based Algorithm for Distributed Mutual Exclusion
In this paper, we present an eecient token-based algorithm for distributed mutual exclusion. The algorithm uses a distributed queue, which is not necessarily FIFO, to enqueue the request messages of the nodes for entry into the critical section (CS). These request messages are timestamped using roughly synchronized clocks. On the average, the algorithm requires 2 to 3 number of messages per cri...
متن کاملProof of Peterson’s algorithm for mutual exclusion∗
4 Checking the model 6 4.1 Validation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.2 Mutual exclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.3 Liveness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.4 Freedom from starvation . . . . . . . . . . . . . . . . . . . . . . . 8 4.5 Results . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملDesigning Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1994
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/37.2.129